package 动态规划;

/**
 * @Author: biubiu0002
 * @Date: 2021-09-25 11:25
 **/
public class 两个字符串的删除操作 {
    public static void main(String[] args) {

    }
    public int minDistance(String word1, String word2) {
        int m = word1.length();//作为行
        int n = word2.length();//作为列

        int[][]dp = new int[m+1][n+1];
        for(int i=0;i<=m;i++){
            dp[i][0]=i;
        }
        for(int i=0;i<=n;i++){
            dp[0][i]=i;
        }
        for(int i=1;i<=m;i++){

            for(int j=1;j<=n;j++){
                char c1 = word1.charAt(i-1);
                char c2 = word2.charAt(j-1);
                if(c1!=c2){
                    dp[i][j]=Math.min(dp[i-1][j],dp[i][j-1])+1;
                }
                else if(c1==c2){
                    dp[i][j]=dp[i-1][j-1];
                }
            }
        }
        return dp[m][n];


    }
}
